Unfolding Restricted Convex Caps
نویسنده
چکیده
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap’s faces are quadrilaterals, with vertices over an underlying integer lattice, and such that the cap convexity is “radially monotone,” a type of smoothness constraint. Extensions of Cauchy’s arm lemma are used in the proof of non-overlap.
منابع مشابه
Addendum to: Edge-Unfolding Nearly Flat Convex Caps
This addendum to [O’R17] establishes that a nearly flat acutely triangulated convex cap in the sense of that paper can be edge-unfolded even if closed to a polyhedron by adding the convex polygonal base under the cap.
متن کاملEdge-Unfolding Nearly Flat Convex Caps
The main result of this paper is a proof that a nearly flat, acutely triangulated convex cap C in R3 has an edge-unfolding to a non-overlapping polygon in the plane. A convex cap is the intersection of the surface of a convex polyhedron and a halfspace. “Nearly flat” means that every outer face normal forms a sufficiently small angle φ < Φ with the ẑ-axis orthogonal to the halfspace bounding pl...
متن کاملUnfolding Prismatoids as Convex Patches: Counterexamples and Positive Results
We address the unsolved problem of unfolding prismatoids in a new context, viewing a “topless prismatoid” as a convex patch—a polyhedral subset of the surface of a convex polyhedron homeomorphic to a disk. We show that several natural strategies for unfolding a prismatoid can fail, but obtain a positive result for “petal unfolding” topless prismatoids. We also show that the natural extension to...
متن کاملAngle-monotone Paths in Non-obtuse Triangulations
We reprove a result of Dehkordi, Frati, and Gudmundsson: every two vertices in a non-obtuse triangulation of a point set are connected by an angle-monotone path— an xy-monotone path in an appropriately rotated coordinate system. We show that this result cannot be extended to angle-monotone spanning trees, but can be extended to boundary-rooted spanning forests. The latter leads to a conjectural...
متن کاملPolyhedra Fabrication through Mesh Convexification: a Study of Foldability of Nearly Convex Shapes
A polyhedron can be unfolded to a net, i.e., an unfolding without overlapping, by carefully cutting along the surface. If the cuts are restricted only on the edges of the polyhedron, where should the cuts be? This is called an edge-unfolding problem, which has been extensively studied in the literature for centuries. Although several promising properties have been discovered, several recent pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0709.1647 شماره
صفحات -
تاریخ انتشار 2007